Learning to agree over large state spaces
نویسندگان
چکیده
We study how a consensus emerges in finite population of like-minded individuals who are asymmetrically informed about the realization true state world. Agents observe private signal and then start exchanging messages. Generalizing classical model rational dialogues Geanakoplos Polemarchakis (1982) its subsequent extensions, we dispense with standard assumption that space is probability do not put any bound on cardinality itself or information partitions. show class can be found always lead to provided three main conditions met. First, everybody must able send messages else, either directly indirectly. Second, communication reciprocal. Finally, agents need have opportunity engage transfinite length.
منابع مشابه
Learning heuristic functions for large state spaces
We investigate the use of machine learning to create effective heuristics for search algorithms such as IDA* or heuristic-search planners such as FF. Our method aims to generate a sequence of heuristics from a given weak heuristic h0 and a set of unsolved training instances using a bootstrapping procedure. The training instances that can be solved using h0 provide training examples for a learni...
متن کاملInverse Reinforcement Learning in Large State Spaces via Function Approximation
This paper introduces a new method for inverse reinforcement learning in large-scale and high-dimensional state spaces. To avoid solving the computationally expensive reinforcement learning problems in reward learning, we propose a function approximation method to ensure that the Bellman Optimality Equation always holds, and then estimate a function to maximize the likelihood of the observed mo...
متن کاملLearning Over Compact Metric Spaces
We consider the problem of learning on a compact metric space X in a functional analytic framework. For a dense subalgebra of Lip(X), the space of all Lipschitz functions on X, the Representer Theorem is derived. We obtain exact solutions in the case of least square minimization and regularization and suggest an approximate solution for the Lipschitz classifier.
متن کاملLeveraging and Learning Propositional Functions for Large State Spaces in Planning and Reinforcement Learning
Planning in large state spaces is a normally computationally infeasible task that crops up in many practical robotics problems. I present a means of leveraging propositional functions in object-oriented Markov Decision Processes (OO-MDPs) to prune state spaces which yields both significant computation speedups as well as generally better plans when applied to baseline planners. Modern reinforce...
متن کاملThe concave integral over large spaces
This paper investigates the concave integral for capacities defined over large spaces. We characterize when the integral with respect to capacity v can be represented as the infimum over all integrals with respect to additive measures that are greater than or equal to v. We introduce the notion of loose extendability and study its relation to the concave integral. A non-additive version for the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Economics
سال: 2022
ISSN: ['1873-1538', '0304-4068']
DOI: https://doi.org/10.1016/j.jmateco.2022.102654